"""
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
"""

class Solution:
    # @param {integer[]} nums1
    # @param {integer} m
    # @param {integer[]} nums2
    # @param {integer} n
    # @return {void} Do not return anything, modify nums1 in-place instead.
    def merge(self, nums1, m, nums2, n):
        """
        :type nums1: []
        :type nums2: []
        """
        while len(nums1) > m:
            nums1.pop()
        while len(nums2) > n:
            nums2.pop()

        for idx, val in enumerate(nums2):
            nums1.append(val)
        nums1.sort()
    
